Markov Chains with Hybrid Repeating Rows – Upper-hessenberg, Quasi-toeplitz Structure of the Block Transition Probability Matrix
نویسندگان
چکیده
In this paper we consider discrete-time multidimensional Markov chains having a block transition probability matrix which is the sum of a matrix with repeating block rows and a matrix of upper-Hessenberg, quasi-Toeplitz structure. We derive sufficient conditions for the existence of the stationary distribution, and outline two algorithms for calculating the stationary distribution.
منابع مشابه
Stationary Probabilities of Markov Chains with Upper Hessenberg Transition Matrices
In this paper, based on probabilistic arguments, we obtain an explicit solution of the stationary distribution for a discrete time Markov chain with an upper Hessenberg time stationary transition probability matrix. Our solution then leads to a numerically stable and efficient algorithm for computing stationary probabilities. Two other expressions for the stationary distribution are also derive...
متن کاملApproximations for Markov Chains with Upper Hessenberg Transition Matrices
Abstract We present an approximation for the stationary distribution T of a countably infinite-state Markov chain with transition probability matrix P = (pq) of upper Hessenberg form. Our approximation makes use of an associated upper Hessenberg matrix which is spatially homogeneous one P ( ~ ) except for a finite number of rows obtained by letting p q = pj-i+l, i > N + 1, for some distribution...
متن کاملStationary Probabilities of Markov Chains
In this paper, based on probabilistic arguments, we obtain an explicit solution of the stationary distribution for a discrete time Markov chain with an upper Hessenberg time stationary transition probability matrix. Our solution then leads to a numerically stable and eecient algorithm for computing stationary probabilities. Two other expressions for the stationary distribution are also derived,...
متن کاملStructured Chains with Repeated Rows: a Simple Algorithmic Solution
In this paper, we study Markov chains with innnite state block-structured transition matrix with repeated rows and rational structure. We provide an algorithmic approach to nd the stationary probability distribution based on the concepts of linear systems theory. These chains include well-known structured Markov chains such as canonical and non-canonical M/G/1 and G/M/1. We provide a truncation...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کامل